A quick Heuristic and a general search algorithm for traveling salesman problem

This paper puts forward a constructive heuristic algorithm called the method of inserting minimum neighbor edge from outside to center (IMNEFOTC) that can be applied solve large-scale and ultra-large-scale travelling salesman problems. Through it randomized greedy (RGH) which is modified, general meta-heuristic search framework built. The (GSA) based on set initial solutions, continuous 2-opt operations are performed, so as for solutions in better quality. data experiment reveals performance IMNEFOTC than traditional algorithm, GSA obtain pretty satisfactory solution reasonable range time.